An optimal decomposition algorithm for tree edit distance
نویسندگان
چکیده
منابع مشابه
Optimal Decomposition Strategy For Tree Edit Distance
An ordered labeled tree is a tree where the left-to-right order among siblings is significant. Given two ordered labeled trees, the edit distance between them is the minimum cost edit operations that convert one tree to the other. In this thesis, we present an algorithm for the tree edit distance problem by using the optimal tree decomposition strategy. By combining the vertical compression of ...
متن کاملAn O(n^3)-Time Algorithm for Tree Edit Distance
The edit distance between two ordered trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this paper, we present a worstcase O(n)-time algorithm for this problem, improving the previous best O(n log n)time algorithm [6]. Our result requ...
متن کاملAn Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity
An ordered labeled tree is a tree in which the nodes are labeled and the left-to-right order among siblings is significant. The edit distance between two ordered labeled trees is the minimum cost of transforming one tree into the other by a sequence of edit operations. Among the best known tree edit distance algorithms, the majority can be categorized in terms of a framework named cover strateg...
متن کاملAn O(n)-Time Algorithm for Tree Edit Distance
The edit distance between two ordered trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this paper, we present a worstcase O(n)-time algorithm for this problem, improving the current best algorithm [7] which runs in O(n log n) worst-c...
متن کاملDecomposition algorithms for the tree edit distance problem
We study the behavior of dynamic programming methods for the tree edit distance problem, such as [5,13]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2009
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1644015.1644017